2 research outputs found
On the minimum latency problem
We are given a set of points and a symmetric distance
matrix giving the distance between and . We wish to
construct a tour that minimizes , where is the
{\em latency} of , defined to be the distance traveled before first
visiting . This problem is also known in the literature as the {\em
deliveryman problem} or the {\em traveling repairman problem}. It arises in a
number of applications including disk-head scheduling, and turns out to be
surprisingly different from the traveling salesman problem in character. We
give exact and approximate solutions to a number of cases, including a
constant-factor approximation algorithm whenever the distance matrix satisfies
the triangle inequality.Comment: 9 page